Symbolic Loop Compilation for Tightly Coupled Processor Arrays

نویسندگان

چکیده

Tightly Coupled Processor Arrays (TCPAs), a class of massively parallel loop accelerators, allow applications to offload computationally expensive loops for improved performance and energy efficiency. To achieve these two goals, executing on TCPA requires an efficient generation specific programs as well other configuration data each distinct combination bounds number available processing elements (PEs). Since both parameters are generally unknown at compile time—the PEs due dynamic resource management, the bounds, because they depend problem size—both must be generated runtime. However, pure just-in-time compilation is impractical, mapping program onto entails solving multiple NP-complete problems. As solution, this article proposes unique mixed static/dynamic approach called symbolic compilation. It shown that time, problems (modulo scheduling, register allocation, routing) can still solved optimality in way resulting so-called , space-efficient intermediate representation parameterized PEs. This phase . At runtime, requested accelerated execution with given known PEs, concrete including PE all components, from according parameter values. instantiation We describe phases detail show runs polynomial time its most complex step, instantiation, not directly depending thus scaling arbitrary sizes TCPAs. validate efficiency approach, we apply set real-world several domains, measuring space requirements. Our experiments confirm suited systems little memory—in many cases, smaller than even single instantiated it—and times runtime loading negligible moreover independent size processor array. give example, instantiating matrix-matrix multiplication benchmark takes equally long 4× 4 32× 32

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LoopInvader: A Compiler for Tightly Coupled Processor Arrays

Continuous technology miniaturization allows to build massively parallel embedded computer architectures within a single silicon chip. Programming that leverages the abundant parallelism in such architectures, however, is very difficult, tedious, and error-prone. Thus, compiler support is paramount. We therefore present LoopInvader, a loop compiler for a particular class of massively parallel p...

متن کامل

Temperature modeling and emulation of an ASIC temperature monitor system for Tightly-Coupled Processor Arrays (TCPAs)

This contribution provides an approach for emulating the behaviour of an ASIC temperature monitoring system (TMon) during run-time for a tightly-coupled processor array (TCPA) of a heterogeneous invasive multi-tile architecture to be used for FPGA prototyping. It is based on a thermal RC modeling approach. Also different usage scenarios of TCPA are analyzed and compared.

متن کامل

A Soft Processor Overlay with Tightly-coupled FPGA Accelerator

FPGA overlays are commonly implemented as coarse-grained reconfigurable architectures with a goal to improve designers’ productivity through balancing flexibility and ease of configuration of the underlying fabric. To truly facilitate full application acceleration, it is often necessary to also include a highly efficient processor that integrates and collaborates with the accelerators while mai...

متن کامل

Increasing Microprocessor Performance with Tightly-Coupled Reconfigurable Logic Arrays

Conventional approaches to increase the performance of microprocessors often do not provide the performance boost one has hoped for due to diminishing returns. We propose the extension of a conventional hardwired microprocessor with a reconngurable logic array, integrating both conventional and reconngurable logic on the same die. Simulations have shown that even a comparatively simple and comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions in Embedded Computing Systems

سال: 2021

ISSN: ['1539-9087', '1558-3465']

DOI: https://doi.org/10.1145/3466897